A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs”
نویسندگان
چکیده
منابع مشابه
The Minimum Spanning Tree Problem on a Planar Graph
Finding a spanning tree of minimum weight is one of the best known graph problems. a liner time algorithm for the minimum spanning tree problem on a planar graph. In [1], Cheriton and Tarjan have proposed a linear time algorithm for this problem. The time complexity of our algorithm is the same as that of Cheriton and Tarjan's algorithm. Dierent from Cheriton and Tarjan's algorithm, our algorit...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملalgorithms for parametric minimum spanning tree problems on planar graphs ’
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators.
متن کاملA Stock Market Filtering Model Based on Minimum Spanning Tree in Financial Networks
There have been several efforts in the literature to extract as much information as possible from the financial networks. Most of the research has been concerned about the hierarchical structures, clustering, topology and also the behavior of the market network; but not a notable work on the network filtration exists. This paper proposes a stock market filtering model using the correlation - ba...
متن کاملThe minimum degree spanning tree problem on directed acyclic graphs
The minimum degree spanning tree problem has been studied extensively. In this paper, we present a polynomial time algorithm for the minimum degree spanning tree problem on directed acyclic graphs. The algorithm starts with an arbitrary spanning tree, and iteratively reduces the number of vertices of maximum degree. We can prove the algorithm must reduce a vertex of the maximum degree for each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2018
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21849